Exact and heuristic approaches for lot splitting and scheduling on identical parallel machines
نویسندگان
چکیده
منابع مشابه
Exact and heuristic approaches for lot splitting and scheduling on identical parallel machines
In this paper, we address a lot splitting and scheduling problem existent in a textile factory. The factory we study produces a set of products that are made of, or assembled from, a list of components. During production, each component can be split into one or several lots of different sizes and each lot will be produced independently on one of a group of identical parallel machines. We formul...
متن کاملOn discrete lot-sizing and scheduling on identical parallel machines
We consider the multi-item discrete lot-sizing and scheduling problem on identical parallel machines. Based on the fact that the machines are identical, we introduce aggregate integer variables instead of individual variables for each machine. For the problem with start-up costs, we show that the inequalities based on a unit flow formulation for each machine can be replaced by a single integer ...
متن کاملminimizing the sum of maximum earliness and tardiness on identical parallel machines scheduling problem
this paper addresses the problem of minimizing the sum of maximum earliness and tardiness on identical parallel machines scheduling problem. each job has a processing time and a due date. since this problem is trying to minimize and diminish the values of earliness and tardiness, the results can be useful for just–in-time production systems. it is shown that the problem is np-hard. using effici...
متن کاملHeuristic Algorithms For Scheduling Jobs On Identical Parallel Machines Via Measures Of Spread
Constructive heuristics for the scheduling problem of n independent jobs on m identical parallel machines with minimum makespan objective are described. The proposed algorithms, which are n log n algorithms as the LPT algorithm of Graham, iteratively combine partial solutions that are obtained by partitioning the set of jobs into suitable families of subsets. The procedure used to partition the...
متن کاملMulti-product lot-sizing and scheduling on unrelated parallel machines
We study a problem of optimal scheduling and lot-sizing a number of products on m unrelated parallel machines to satisfy given demands. A sequence dependent setup time is required between lots of different products. The products are assumed to be all continuously divisible or all discrete. The criterion is to minimize the time, at which all the demands are satisfied, Cmax, or the maximum latene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Manufacturing Technology and Management
سال: 2011
ISSN: 1368-2148,1741-5195
DOI: 10.1504/ijmtm.2011.038482